Simple Gene Assembly Is Deterministic
نویسندگان
چکیده
We investigate in this paper a simple intramolecular model for gene assembly in ciliates. Unlike the general intramolecular model, the folds that a micronuclear chromosome may form to assemble the genes is very restricted (minimal) here: between any two pointers there may be at most one coding block. It has been known that the general model is universal, being able to assemble any gene pattern (to sort any signed permutation). The simple model on the other hand is not universal: there exist signed permutations that cannot be sorted in this model. Remarkably though, all known micronuclear gene patterns in ciliates can indeed be assembled in the simple model. We prove in this paper that while the general model is non-deterministic, the simple model is “weakly deterministic”: any gene pattern either has only successful or only unsuccessful sorting strategies. Moreover, although different strategies may lead to different permutations for the same input, these final results have the same structure.
منابع مشابه
A novel bi-level stochastic programming model for supply chain network design with assembly line balancing under demand uncertainty
This paper investigates the integration of strategic and tactical decisions in the supply chain network design (SCND) considering assembly line balancing (ALB) under demand uncertainty. Due to the decentralized decisions, a novel bi-level stochastic programming (BLSP) model has been developed in which SCND problem has been considered in the upper-level model, while the lower-level model contain...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملLimitations of self-assembly at temperature 1
We prove that if a set X ⊆ Z weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as pumpability, then X is a semilinear set. This shows that only the most simple of infinite shapes and patterns can be constructed using pumpable temperature 1 tile assembly systems, and gives evidence for the thesis that temperature 2 or hi...
متن کاملCooperativity in biological systems
Living organisms can sense and respond to external and internal stimuli. Response isdemonstrated in many forms including modulation of gene expression profiles, motility,secretion, cell death, etc. Nevertheless, all forms share a basic property: they depend on sensingsmall changes in the concentration of an effector molecule or subtle conformational changes ina protein and invoking the appropri...
متن کاملA new heuristic method based on CPM in SALBP
The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 73 شماره
صفحات -
تاریخ انتشار 2006